Function minimization by conjugate gradients
نویسندگان
چکیده
منابع مشابه
Flexible Conjugate Gradients
We analyze the conjugate gradient (CG) method with preconditioning slightly variable from one iteration to the next. To maintain the optimal convergence properties, we consider a variant proposed by Axelsson that performs an explicit orthogonalization of the search directions vectors. For this method, which we refer to as flexible CG, we develop a theoretical analysis that shows that the conver...
متن کاملSuperlinear Convergence of Conjugate Gradients
We give a theoretical explanation for superlinear convergence behavior observed while solving large symmetric systems of equations using the conjugate gradient method or other Krylov subspace methods. We present a new bound on the relative error after n iterations. This bound is valid in an asymptotic sense when the size N of the system grows together with the number of iterations. The bound de...
متن کاملConjugate Gradients on Multiple GPUs
A GPU accelerated Conjugate Gradient solver is tested on eight different matrices with different structural and numerical characteristics. The first four matrices are obtained by discretizing the 3D Poisson’s equation, which arises in many fields such as computational fluid dynamics, heat transfer and so on. Their relatively low bandwidth and low condition numbers makes them ideal targets for G...
متن کاملRegularization of Ill-Posed Problems by Envelope Guided Conjugate Gradients
18 of. Obviously the tail strategy is an improvement over iterating the PCG method without regularization. Thus we have shown that the envelope guided conjugate gradient strategy of section 3 has been successfully applied to a problem. It is inexpensive, robust, and eeective.
متن کاملImage Reconstruction Through Regularization by Envelope Guided Conjugate Gradients
29 Figure 12: Tail strategy for 10 million registered photon pairs. all images in enhanced display. 28 Figure 11: Tail strategy for 10 million registered photon pairs. The result of the quadratic case was used as start for the other cases; all images in enhanced display. top row: quadratic, log for = 2 13 , logcosh for = 2 5 ; bottom row: Huber for, = 2 8 , multiquadric for = 2 8 , rational for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1964
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/7.2.149